3-Set Theory-Set Properties

abstraction principle

If all set members have a property, set has property {abstraction principle} {principle of abstraction}.

adjunction

Elements added to sets {adjunction} can extend set properties.

bound of set

Sets have a highest member {upper bound, set} {bound}. Sets have a lowest member {lower bound, set}. Sets can have minimum at highest member {greatest lower bound, set}. Sets can have maximum at lowest member {least upper bound, set}.

cyclic permutation

Ordered-set elements can advance one place {cyclic permutation}. Cyclic permutations can have only two elements {transposition, set}.

extension principle

Two sets are equal if and only if sets have same members {principle of extension} {extension principle}.

injection mapping

The identity relation can apply to domain subset {injection mapping}.

integral domain

Sets can have two binary operations {integral domain}. Operations make commutative rings and have identity elements. First operation has identity element if second operation happens.

interior point

Open sets can contain no point {interior point} at boundary.

one-to-one correspondence

Two sets are equivalent if their elements pair {one-to-one correspondence}|.

ordered in sets

Relations {ordered} between two or more things can have sequence. Sequence does not have to be complete {partial order}.

number

For two things, first {first coordinate} and second {second coordinate} make pair {ordered pair, set} or relation {binary relation}. First coordinate belongs to domain. Second coordinate belongs to range. Second coordinate derives from first coordinate {Cartesian product, pair}.

Relations can be among many things {ordered n-tuple} {n-ary relation}, with many coordinates.

types

Order can be linear {simple order} {linear order}. All set members can have simple order {chain, set}. Non-empty sets can have unique lowest members {well-ordered set}.

value

Sets can have unique lowest {least element} member. Sets can have unique highest {greatest element} member. Maximum at lowest member {least upper bound, element} and minimum at highest member {greatest lower bound, element} bound interval.

partition of set

Sets can split {partition, set}| into mutually exclusive subsets.

symmetric in sets

Relation between second coordinate and first coordinate can be image of relation between first coordinate and second coordinate {symmetric}. Relations can be reflexive and transitive {antisymmetric}, so both members are equal.

Related Topics in Table of Contents

3-Set Theory

Drawings

Drawings

Contents and Indexes of Topics, Names, and Works

Outline of Knowledge Database Home Page

Contents

Glossary

Topic Index

Name Index

Works Index

Searching

Search Form

Database Information, Disclaimer, Privacy Statement, and Rights

Description of Outline of Knowledge Database

Notation

Disclaimer

Copyright Not Claimed

Privacy Statement

References and Bibliography

Consciousness Bibliography

Technical Information

Date Modified: 2022.0225